Algebraic Boundaries of $$\mathrm{SO}(2)$$ SO ( 2 ) -Orbitopes
نویسندگان
چکیده
منابع مشابه
Algebraic boundaries of convex semi-algebraic sets
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the dual polytope to general semi-algebraic convex sets. In this case, exceptional families of extreme points might exist and we characterise them semi-algebraically. We also give a strategy for computing a com...
متن کاملPacking and Partitioning Orbitopes
We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at most or exactly one 1-entry in each row, respectively. The goal of investigating these polytopes is to gain insight into ways of breaking certain symmetries ...
متن کاملAlgebraic Boundaries of Hilbert’s Sos Cones
We study the geometry underlying the difference between nonnegative polynomials and sums of squares. The hypersurfaces that discriminate these two cones for ternary sextics and quaternary quartics are shown to be Noether-Lefschetz loci of K3 surfaces. The projective duals of these hypersurfaces are defined by rank constraints on Hankel matrices. We compute their degrees using numerical algebrai...
متن کاملSome algebraic properties of Lambert Multipliers on $L^2$ spaces
In this paper, we determine the structure of the space of multipliers of the range of a composition operator $C_varphi$ that induces by the conditional expectation between two $L^p(Sigma)$ spaces.
متن کاملExtended Formulations for Packing and Partitioning Orbitopes
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in [6]. These polytopes are the convex hulls of all 0/1-matrices with lexicographically sorted columns and at most, resp. exactly, one 1-entry per row. They are important objects for symmetry reduction in certain integer programs. Using the extended ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9501-5